Reducing Preferential Paraconsistent Reasoning to Classical Entailment
نویسندگان
چکیده
منابع مشابه
Formula-Preferential Systems for Paraconsistent Non-Monotonic Reasoning
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. The framework encompasses different types of preferential systems that were developed from different motivations of paraconsistent reasoning and...
متن کاملFormula - Preferential Systems for Paraconsistent Non - Monotonic Reasoning ( an extended
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. The framework encompasses different types of preferential systems that were developed from different motivations of paraconsistent reasoning and...
متن کاملA Formula-Preferential Base for Paraconsistent and Plausible Reasoning Systems
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. We show that these natural preferential systems that were originally designed for paraconsistent reasoning fulfill a key condition (stopperednes...
متن کاملParaconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. This framework provides a useful platform for capturing, in a simple and natural way, a wide range of methods for preferential reasoning. Off-the-shelf QBF solvers may therefore be incorporated for simulating the corr...
متن کاملReasoning About Typicality in Preferential Description Logics: Preferential vs Rational Entailment
Extensions of Description Logics (DLs) to reason about typicality and defeasible inheritance have been largely investigated. In this paper, we consider two such extensions, namely (i) the extension of DLs with a typicality operator T, having the properties of Preferential nonmonotonic entailment P, and (ii) its variant with a typicality operator having the properties of the stronger Rational en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2003
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/13.4.557